Towards shortest path identification on large networks
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Path Analysis for Efficient Traversal Queries in Large Networks
The shortest path problem is among the most fundamental combinatorial optimization problems to answer reach-ability queries. A single pair shortest path computation using Dijkstra’s algorithm requires few seconds on a very large social network. Many traversal algorithms imply precomputed information to speed up the runtime query process. However, computing effective auxiliary data in a reasonab...
متن کاملMemory-Efficient Fast Shortest Path Estimation in Large Social Networks
As the sizes of contemporary social networks surpass billions of users, so grows the need for fast graph algorithms to analyze them. A particularly important basic operation is the computation of shortest paths between nodes. Classical exact algorithms for this problem are prohibitively slow on large graphs, which motivates the development of approximate methods. Of those, landmark-based method...
متن کاملalgorithms for biobjective shortest path problems in fuzzy networks
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملEffective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks
In a constrained shortest path (CSP) query, each edge in the road network is associated with both a length and a cost. Given an origin s, a destination t, and a cost constraint θ, the goal is to find the shortest path from s to t whose total cost does not exceed θ. Because exact CSP is NP-hard, previous work mostly focuses on approximate solutions. Even so, existing methods are still prohibitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Big Data
سال: 2016
ISSN: 2196-1115
DOI: 10.1186/s40537-016-0042-7